Probability on Graphs Random Processes on Graphs and Lattices
نویسندگان
چکیده
منابع مشابه
h . PR ] 1 5 Ja n 20 02 On the physical relevance of random walks : an example of random walks on a randomly oriented lattice ∗
Random walks on general graphs play an important role in the understanding of the general theory of stochastic processes. Beyond their fundamental interest in probability theory, they arise also as simple models of physical systems. A brief survey of the physical relevance of the notion of random walk on both undirected and directed graphs is given followed by the exposition of some recent resu...
متن کاملContinuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical transport processes on graphs, and calculate the spacetime transition probabilities between two vertices of the lattice. Then we analytically show that ther...
متن کاملOn Spanning Structures in Random Hypergraphs
In this note we adapt a general result of Riordan [Spanning subgraphs of random graphs, Combinatorics, Probability & Computing 9 (2000), no. 2, 125–148] from random graphs to random r-uniform hypergaphs. We also discuss several spanning structures such as cube-hypergraphs, lattices, spheres and Hamilton cycles in hypergraphs.
متن کاملConvergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs
This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, V ertex Separation, Edge Bisection and V ertex Bisection. For full square lattices, we give optimal layouts for the problems still...
متن کاملRobustness of Random Graphs Based on Natural Connectivity
Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the weighted number of closed walks of all lengths and can be regarded as the average eigenvalue obtained from the graph spectrum. In this article, we explore the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009